Path-path Ramsey-type numbers for the complete bipartite graph
نویسندگان
چکیده
منابع مشابه
Ramsey Numbers for the Pair Sparse Graph-path or Cycle
Let G be a connected graph on n vertices with no more than n(\ + e) edges, and Pk or Ck a path or cycle with k vertices. In this paper we will show that if n is sufficiently large and e is sufficiently small then for k odd r(G, Ck) In 1. Also, for k > 2, r(G, Pk) = max{/i -t[k/2] l,n + k 2 a' 8), where a' is the independence number of an appropriate subgraph of G and 5 is 0 or 1 depending upon ...
متن کاملPath-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a subgraph or the complement of G contains H as a subgraph. In this paper, we study the Ramsey numbers R(Pn, K̂m), where Pn is a path on n vertices and K̂m is the graph obtained from the join of K1 and Pm. We determine the ...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملPath-fan Ramsey numbers
For two given graphs G and H , the Ramsey number R(G, H) is the smallest positive integer p such that for every graph F on p vertices the following holds: either F contains G as a subgraph or the complement of F contains H as a subgraph. In this paper, we study the Ramsey numbers R(Pn, Fm), where Pn is a path on n vertices and Fm is the graph obtained from m disjoint triangles by identifying pr...
متن کاملSome Ramsey numbers for complete bipartite graphs
Upper bounds are determined for the Ramsey number ](m,n), 2 :; m n. These bounds are attained for infinitely many n in case of m 3 and are fairly close to the exact value for every m if n is sufficiently large.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1975
ISSN: 0095-8956
DOI: 10.1016/0095-8956(75)90081-7